AYALSOPLAN: Bitstate Pruning for State-Based Planning on Massively Parallel Compute Clusters

نویسندگان

  • Juhan Ernits
  • Charles Gretton
  • Richard Dearden
چکیده

Many planning systems operate by performing a heuristic forward search in the problem state space. In large problems that approach fails, exhausting a computer’s memory due to the burden of storing problem states. Moreover, it is an open question exactly how that approach should be parallelized to take advantage of modern multiple-processor computers and the proliferation of massively parallel compute clusters. This extended abstract proposes an answer to this second question, while also going some way to addressing the memory prob-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively parallel motion planning algorithms under uncertainty using POMDP

We present new parallel algorithms that solve continuous-state partially observable Markov decision process (POMDP) problems using the GPU (gPOMDP) and a hybrid of the GPU and CPU (hPOMDP). We choose the Monte Carlo value iteration (MCVI) method as our base algorithm and parallelize this algorithm using the multi-level parallel formulation of MCVI. For each parallel level, we propose efficient ...

متن کامل

On the Scaling Behavior of HDA

Parallel search on parallel clusters has the potential to provide the memory and the CPU resources needed to solve challenging search problems, including planning instances. The Hash Distributed A* (HDA*) algorithm (Kishimoto, Fukunaga, and Botea 2009) is a simple, scalable parallelization of A*. HDA* runs A* on every processor, each with its own open and closed lists. HDA* uses the work distri...

متن کامل

A Parallel Algorithm for Graph Matching and Its MasPar Implementation

Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation tim...

متن کامل

Investigating Effect of Short, Medium, and Long Pruning on Yield And Yield Components of Tayefi Grape Before and After Winter Cold

One of the most important operations in managed gardens is pruned grapes. For evaluate the effect of pruning short, medium, heavy on yield and yield components of Taif grapes, before and after the cold winter, in the years 2012 to 2013, A factorial experiment in a CRBD design with five replicates were performed on two factors. The first factor was the number of buds per stem and included the th...

متن کامل

Investigating Effect of Short, Medium, and Long Pruning on Yield And Yield Components of Tayefi Grape Before and After Winter Cold

One of the most important operations in managed gardens is pruned grapes. For evaluate the effect of pruning short, medium, heavy on yield and yield components of Taif grapes, before and after the cold winter, in the years 2012 to 2013, A factorial experiment in a CRBD design with five replicates were performed on two factors. The first factor was the number of buds per stem and included the th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011